Factoring Small Integers: An Experimental Comparison
نویسنده
چکیده
In this data-based paper we report on our experiments in factoring integers from 50 to 200 bits with the postsieving phase of NFS as a potential application. We implemented and compared several general-purpose factoring algorithms suited for these smaller numbers, from Shanks’s square form factorization method to the self-initializing quadratic sieve, and revisited the older continued fraction method testing new practical ideas. We give detailed timings for our implementations to better assess their relative range of practical use on current hardware.
منابع مشابه
Factoring Small to Medium Size Integers: An Experimental Comparison
We report on our experiments in factoring integers from 50 to 200 bit with the NFS postsieving stage or class group structure computations as potential applications. We implemented, with careful parameter selections, several general-purpose factoring algorithms suited for these smaller numbers, from Shanks’s square form factorization method to the self-initializing quadratic sieve, and revisite...
متن کاملA heuristic search based factoring tool
Factoring is believed to be a diflcult task. Although factoring is of interest in its own right, the security of RSA cryptography, among other cryptographic systems, is dependent on the diflculty of factoring the product of two large primes. We show how to cast the problem of factoring integers as a state-based search to which the techniques of AI may be applied. Using small primes as operators...
متن کاملFactoring Integers Using the Web
This note provides background on the www-factoring project, which was started in the fall of 1995. Factoring a positive integer ri means finding two positive integers u and v such that the product of u and v equals ri, and such that both u a.nd v are greater than 1. Such u and v are called factors (or divisors) of ii, and n = u v is called a factorization of n. Positive integers that ca.n be fa...
متن کاملBreaking RSA May Be Easier Than Factoring
We provide evidence that breaking low-exponent rsa cannot be equivalent to factoring integers. We show that an algebraic reduction from factoring to breaking low-exponent rsa can be converted into an e cient factoring algorithm. Thus, in e ect an oracle for breaking rsa does not help in factoring integers. Our result suggests an explanation for the lack of progress in proving that breaking rsa ...
متن کاملA parallel line sieve for the GNFS Algorithm
RSA is one of the most important public key cryptosystems for information security. The security of RSA depends on Integer factorization problem, it relies on the difficulty of factoring large integers. Much research has gone into problem of factoring a large number. Due to advances in factoring algorithms and advances in computing hardware the size of the number that can be factorized increase...
متن کامل